Randomized Response Group Testing Model
نویسندگان
چکیده
منابع مشابه
Constrained Group Testing to Predict Binding Response of Candidate Compounds
We study the problem of identifying reactive compound(s) in a solution as e ciently as possible, with the goal of minimizing the number of chemical tests required to make exact identification. The area of group testing is appropriate for this problem, except that most group testing approaches assume that arbitrary tests can be performed, which is not the case in our application. To address this...
متن کاملExogenous Ketone Supplement Ingestion And Submaximal Exercise Response in Trained, Male Cyclists: A Randomised, Double-blind Study
Background. The acute ingestion of ketone body supplements can improve exercise responses such as oxygen consumption and blood lactate. Additionally, ketone body supplements show increases in circulating βhb concentration, matching those of someone in a state of nutritional ketosis. Studies testing ketone body supplements have reported different results in exercise response and varying gastroin...
متن کاملLINEAR HYPOTHESIS TESTING USING DLR METRIC
Several practical problems of hypotheses testing can be under a general linear model analysis of variance which would be examined. In analysis of variance, when the response random variable Y , has linear relationship with several random variables X, another important model as analysis of covariance can be used. In this paper, assuming that Y is fuzzy and using DLR metric, a method for testing ...
متن کاملar X iv : q ua nt - p h / 05 06 26 5 v 4 8 M ay 2 00 7 Quantum Complexity of Testing Group Commutativity ∗
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We construct a quite optimal quantum algorithm for this problem whose complexity is in Õ(k). The algorithm uses and highlights the power of the quantiz...
متن کاملar X iv : q ua nt - p h / 05 06 26 5 v 2 4 A ug 2 00 5 Quantum Complexity of Testing Group Commutativity ∗
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We construct a quite optimal quantum algorithm for this problem whose complexity is in Õ(k). The algorithm uses and highlights the power of the quantiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013